منابع مشابه
Many Vulnerable or a Few Resilient Specimens? Finding the Optimal for Reintroduction/Restocking Programs
Most reintroduction and restocking programs consist of releasing captive-raised juveniles. The usefulness of these programs has been questioned, and therefore, quality control is advisable. However, evaluating restocking effectiveness is challenging because mortality estimation is required. Most methods for estimating mortality are based on tag recovery. In the case of fish, juveniles are tagge...
متن کاملOn finding spanning trees with few leaves
The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection). Besides this application, the problem has its own theoretical importance as a generalization of the Hamiltonian path problem. Lu and Ravi showed that there is no constant f...
متن کاملFinding the Privileged Few: Supporting Privilege Review for E-Discovery
As typically conceived, the goal of information retrieval is to help people find what they seek. However, when sensitive content is intermixed with what is sought, it can be equally important to help protect what should not be seen. This paper focuses on one such case, the protection of content that is subject to a claim of attorney-client privilege when sharing evidence incident to civil litig...
متن کاملFinding Hamilton cycles in random graphs with few queries
We introduce a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of G(n, p) in order to typically find a subgraph possessing a given target property. We show that if p ≥ lnn+ln lnn+ω(1) n , then one can find a Hamilton cycle with high probability after exposing (1+o(1))n edges. Our result i...
متن کاملImproving the Efficiency of Retrieval Effectiveness Evaluation: Finding a Few Good Topics with Clustering?
We consider the issue of using fewer topics in the effectiveness evaluation of information retrieval systems. Previous work has shown that using fewer topics is theoretically possible; one of the main issues that remains to be solved is how to find such a small set of a few good topics. To this aim, in this paper we try a novel approach based on clustering of topics. We consider various algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Genetics
سال: 2016
ISSN: 1471-0056,1471-0064
DOI: 10.1038/nrg.2016.54